The Posso Library for Polynomial System Solving

نویسندگان

  • GIUSEPPE ATTARDI
  • CARLO TRAVERSO
چکیده

The PoSSo library is a sophisticated library of tools for solving systems of polynomial equations. Each tool is supplied as a framework, rather than as a traditional program library or as a self-contained package, providing a unusual level of exibility. Each framework consists of a collection of C++ classes, which allows the customisation of each tool. Customisation can happen either at compile time with the addition of new derived classes, or at run time through the selection from tables among predeened choices. Tools like the Customisable Memory Management, allow for instance memory management to be nely tuned to the requirements of the Buchberger algorithm. This algorithm in turn can be specialised to work on diierent polynomial rings. The library achieves high levels of eeciency both by incorporating advanced algorithms and by allowing the user to select the most appropriate strategy for each particular problem. 1. The PoSSo project Project PoSSo (Polynomial System Solving) has developed symbolic computation tools for eeciently solving systems of polynomial equations. These tools are collected in a portable library which provides the latest algorithms for polynomial systems. The library is suitable for incorporation into applications programs, in areas such as: kinematics, control theory, geometric modelling, and biochemistry. Purely numerical solving of polynomial systems manifests some problems: numerical inaccuracy; failing to nd all solutions or to recognise under-determined systems; not providing an understanding of the structure of the solutions; and inability to handle over-determined systems. These problems are not purely theoretical: they have caused major practical problems in areas ranging from aerospace engineering to pharmacology. The solution to these problems is to perform symbolic computation on the set of polynomial equations (and inequalities) instead of, or as well as, numeric computation. Such computations require proper use of advanced mathematical concepts. While currently scientiic software in general and computer algebra in particular is delivered to users via all-purpose packages which provide a variety of services, the 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Single Phase Fluid Flow Instability Equations Using Chebyshev Tau- QZ Polynomial

In this article the instability of single phase flow in a circular pipe from laminar to turbulence regime has been investigated. To this end, after finding boundary conditions and equation related to instability of flow in cylindrical coordination system, which is called eigenvalue Orr Sommerfeld equation, the solution method for these equation has been investigated. In this article Chebyshev p...

متن کامل

Numerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method

In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.

متن کامل

A Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases

In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

Non-polynomial Spline Method for Solving Coupled Burgers Equations

In this paper, non-polynomial spline method for solving Coupled Burgers Equations are presented. We take a new spline function. The stability analysis using Von-Neumann technique shows the scheme is unconditionally stable. To test accuracy the error norms 2L, L are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995